منابع مشابه
Private Key based query on encrypted data
Nowadays, users of information systems have inclination to use a central server to decrease data transferring and maintenance costs. Since such a system is not so trustworthy, users' data usually upkeeps encrypted. However, encryption is not a nostrum for security problems and cannot guarantee the data security. In other words, there are some techniques that can endanger security of encrypted d...
متن کاملQuery Session Data vs. Clickthrough Data as Query Suggestion Resources
Query suggestion has become one of the most fundamental features of Web search engines. Some query suggestion algorithms utilize query session data, while others utilize clickthrough data. The objective of this study is to examine which of these two resources can provide more effective query suggestions. Our results show that query session data outperforms clickthrough data in terms of clickthr...
متن کاملBig Data Query Parallelization
The amount of data stored worldwide has reached the exabyte range (one quintillion of bytes). The first generation of databases based on relational algebra is hitting its limits. Therefore, companies dealing with Big Data such as Google, Facebook, or Twitter had to come up with their own frameworks and database systems in order to cope with such data scale. In parallel, a second generation of d...
متن کاملRelational Data and Meta - Data Query
We introduce the uniform data model to reason about relational data and meta-data query processing. The principal property of the uniform data model is that both meta-data and data are organized in uniformly shaped information objects. This uniform treatment of meta-data and data allows for the design of query languages that are independent of the meta-data/data separation. We present two query...
متن کاملDual Query: Practical Private Query Release for High Dimensional Data
We present a practical, differentially private algorithm for answering a large number of queries on high dimensional datasets. Like all algorithms for this task, ours necessarily has worst-case complexity exponential in the dimension of the data. However, our algorithm packages the computationally hard step into a concisely defined integer program, which can be solved non-privately using standa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: HortScience
سال: 1991
ISSN: 0018-5345,2327-9834
DOI: 10.21273/hortsci.26.8.945f